A Fast Algorithm for Building Lattices
نویسندگان
چکیده
This paper presents a simple, efficient algorithm to compute the covering graph of the lattice generated by a family B of subsets of a set X. The implementation of this algorithm has O((|X| + |B|) · |B|) time complexity per lattice element. This improves previous algorithms of Bordat (1986), Ganter and Kuznetsov (1998) and Jard et al. (1994). This algorithm can be used to compute the Galois (concept) lattice, the maximal antichains lattice or the Dedekind–MacNeille completion of a partial order, without increasing time complexity. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Building multi-adjoint concept lattices
In Formal Concept Analysis it is very important to study fast algorithms to compute concept lattices. This paper introduces an algorithm on the multiadjoint concept lattice framework, in order to compute the whole concept lattice. This fuzzy framework is very general and provides more flexibility in relational systems. This has been theoretically studied and, now, we need an algorithm to comput...
متن کاملEfficient Incremental Algorithm for Building Swiftly Concepts Lattices
Efficient tool and platform for several areas, concept lattice are widely used in many fields of research. Dynamic environment requires an incremental algorithm to build formal concepts. It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts. Algorithmic complexity is studied both theoretically (i...
متن کاملA Hybrid Framework for Building an Efficient Incremental Intrusion Detection System
In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...
متن کاملFast, exact and stable reconstruction of multivariate algebraic polynomials in Chebyshev form
We describe a fast method for the evaluation of an arbitrary high-dimensional multivariate algebraic polynomial in Chebyshev form at the nodes of an arbitrary rank-1 Chebyshev lattice. Our main focus is on conditions on rank-1 Chebyshev lattices allowing for the exact reconstruction of such polynomials from samples along such lattices and we present an algorithm for constructing suitable rank-1...
متن کاملA Linear Delay Algorithm for Building Concept Lattices
Concept lattices (also called Galois lattices) have been applied in numerous areas, and several algorithms have been proposed to construct them. Generally, the input for lattice construction algorithms is a binary matrix with size |G||M | representing binary relation I ⊆ G×M . In this paper, we consider polynomial delay algorithms for building concept lattices. Although the concept lattice may ...
متن کاملModified particle swarm optimization algorithm to solve location problems on urban transportation networks (Case study: Locating traffic police kiosks)
Nowadays, traffic congestion is a big problem in metropolises all around the world. Traffic problems rise with the rise of population and slow growth of urban transportation systems. Car accidents or population concentration in particular places due to urban events can cause traffic congestions. Such traffic problems require the direct involvement of the traffic police, and it is urgent for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 71 شماره
صفحات -
تاریخ انتشار 1999